A trivalent graph of girth ten
نویسندگان
چکیده
منابع مشابه
A trivalent graph of girth 17
A family of trivalent graphs is described that includes most of the known trivalent cages. A new graph in this family is the smallest trivalent graph of girth 17 yet discovered.
متن کاملA Small Trivalent Graph of Girth 14
We construct a graph of order 384, the smallest known trivalent graph of girth 14. AMS Subject Classifications: 05D25, 05D35 In this note we use a construction technique that can be viewed as a kind of generalized Cayley graph. The vertex set V of such a graph consists of the elements in multiple copies of some finite group G. The action of G on V is determined by the regular action on each of ...
متن کاملA trivalent graph with 58 vertices and girth 9
A regular graph with valency k and girth g will be referred to as a (/,. ~.,, ,:_';~,~,+ Petersen 's graph is a (3, 5)-graph; indeed, it is the (unique) smallest (3. :,)-, ~,~;+ In general, the problem of finding a smallest (k, g)-graph is hard, an~ ~;-~,~: .~;;.-,~,'~/~ is known only for a few values of k and g. The particular case k = 3 , g = 9 has been the subject of much e~ i~::~..t~r~,...,...
متن کاملOn the girth of the annihilating-ideal graph of a commutative ring
The annihilating-ideal graph of a commutative ring $R$ is denoted by $AG(R)$, whose vertices are all nonzero ideals of $R$ with nonzero annihilators and two distinct vertices $I$ and $J$ are adjacent if and only if $IJ=0$. In this article, we completely characterize rings $R$ when $gr(AG(R))neq 3$.
متن کاملComputing the Girth of a Planar Graph
We give an O(n log n) algorithm for computing the girth (shortest cycle) of an undirected n-vertex planar graph. Our solution extends to any graph of bounded genus. This improves upon the best previously known algorithms for this problem.
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Journal of Combinatorial Theory, Series B
سال: 1972
ISSN: 0095-8956
DOI: 10.1016/0095-8956(72)90028-7